Hypergroups and distance distributions of random walks on graphs

نویسندگان

چکیده

Wildberger's construction enables us to obtain a hypergroup from random walk on special graph. We will give probability theoretic interpretation products the hypergroup. The can be identified with commutative algebra whose basis is transition matrices. estimate operator norm of such matrix and clarify relationship between their walks.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hypergroups derived from random walks on some infinite graphs

Wildberger gave a method to construct a finite hermitian discrete hypergroup from a random walk on a certain kind of finite graphs. In this article, we reveal that his method is applicable to a random walk on a certain kind of infinite graphs. Moreover, we make some observations of finite or infinite graphs on which a random walk produces a hermitian discrete hypergroup.

متن کامل

Random Walks on Random Graphs

The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs. Given a graphG = (V,E), let dG(v) denote the degree of vertex v for all...

متن کامل

Random walks on random graphs

Random walks on random graphs – p. 1/2

متن کامل

Random walks on graphs

Let G = (V,E) be a connected, undirected graph. We shall consider the following model of a random walk on G. The walk starts out at time 0 in some initial distribution on the vertex set V ; the initial condition may be deterministic, which corresponds to the distribution assigning probability 1 to a single vertex. The random walk is constructed as follows. There are independent unit rate Poisso...

متن کامل

Hypergroups associated to random walks on the Platonic solids

We explicitly construct the convolution hypergroups of spheres in the vertex graphs of the classical Platonic solids, their character tables, and the structure of their dual signed hypergroups. This allows us to easily determine certain aspects of the random walks on these graphs. The character tables share many of the pleasant properties of character tables of finite groups.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematica Scandinavica

سال: 2021

ISSN: ['0025-5521', '1903-1807']

DOI: https://doi.org/10.7146/math.scand.a-122932